Smoothed octagon

 ( Packing Problems ) 

The smoothed octagon is a region in the plane found by Karl Reinhardt in 1934 and conjectured by him to have the lowest maximum packing density of the plane of all centrally symmetric convex shapes. It was also independently discovered by Kurt Mahler in 1947. It is constructed by replacing the corners of a regular octagon with a section of a hyperbola that is tangent to the two sides adjacent to the corner and asymptotic to the sides adjacent to these.

---

Construction The hyperbola that forms each corner of the smoothed octagon is tangent to two sides of a regular octagon, and asymptotic to the two adjacent to these. The following details apply to a regular octagon of circumradius $\backslash sqrt\{2\}$ with its centre at the point $(2+\backslash sqrt\{2\},0)$ and one vertex at the point $(2,0)$. For two constants $\backslash ell=\backslash sqrt\{2\}\; -\; 1$ and $m=(1/2)^\{1/4\}$, the hyperbola is given by the equation $$\backslash ell^2x^2-y^2=m^2$$ or the equivalent parameterization (for the right-hand branch only)

for the portion of the hyperbola that forms the corner, given by the range of parameter values

The lines of the octagon tangent to the hyperbola are $y=\; \backslash pm\; \backslash left(\backslash sqrt\{2\}\; +\; 1\; \backslash right)\; \backslash left(\; x-2\; \backslash right)$, and the lines asymptotic to the hyperbola are simply $y\; =\; \backslash pm\; \backslash ell\; x$.

---

Packing For every centrally symmetric convex planar set, including the smoothed octagon, the maximum packing density is achieved by a lattice packing, in which unrotated copies of the shape are translated by the vectors of a lattice. The smoothed octagon achieves its maximum packing density, not just for a single packing, but for a 1-parameter family. All of these are lattice packings. The smoothed octagon has a maximum packing density given by $$\backslash frac\{\; 8-4\backslash sqrt\{2\}-\backslash ln\{2\}\; \}\{2\backslash sqrt\{2\}-1\}\; \backslash approx\; 0.902414\; \backslash ,\; .$$

This is lower than the circle packing, which is $$\backslash frac\{\backslash pi\}\{\backslash sqrt\{12\}\}\; \backslash approx\; 0.906899.$$

The maximum known packing density of the ordinary regular octagon is $$\backslash frac\{4\; +\; 4\; \backslash sqrt\{2\}\}\{5\; +\; 4\; \backslash sqrt\{2\}\}\; \backslash approx\; 0.906163,$$ also slightly less than the maximum packing density of circles, but higher than that of the smoothed octagon.

---

Conjectured optimality Reinhardt's conjecture that the smoothed octagon has the lowest maximum packing density of all centrally symmetric convex shapes in the plane remains unsolved. However, Thomas Hales and Koundinya Vajjha claimed to have proved a weaker conjecture, which asserts that the most unpackable centrally symmetric convex disk must be a smoothed polygon. Additionally, Fedor Nazarov provided a partial result by proving that the smoothed octagon is a local minimum for packing density among centrally symmetric convex shapes.

If central symmetry is not required, the regular heptagon is conjectured to have even lower packing density, but neither its packing density nor its optimality have been proven. In three dimensions, Ulam's packing conjecture states that no convex shape has a lower maximum packing density than the ball.

---

External links

• Packing smoothed octagons. John Baez, Visual Insight, AMS Blogs, 2014.
• The thinnest densest two-dimensional packing?. Peter Scholl, 2001.

Post Comment